Alternative forms of propositional calculus for a given deduction theorem.
نویسندگان
چکیده
منابع مشابه
Alternative forms of propositional calculus for a given deduction theorem
In a propositional calculus based on combinatory logic it is necessary to have a restriction on the deduction theorem for implication as otherwise Curry's paradox results (see [5]). In [1] and [2] we restricted the deduction theorem for implication as follows: where Δ is any sequence of obs and HX stands for "X is a proposition". Motivation for this deduction theorem was given in [2] using the ...
متن کاملPropositional Deduction via Sequent Calculus
We have left out negation. We regard ¬φ as a shorthand for φ→ ⊥. A sequent is a pair that packages together some assumptions and a conclusion. We write Γ ` φ for the sequent whose assumptions are the finite set of formulas Γ and whose conclusion is the formula φ. We call Γ the antecedent and φ the consequent of the sequent Γ ` φ. A sequent is satisfied in a model M iff either M |= φ or for some...
متن کاملDeduction Theorem for Symmetric Cirquent Calculus
Cirquent calculus is a recent approach to proof theory, whose characteristic feature is being based on circuit-style structures (called cirquents) instead of the traditional formulas or sequents. In this paper we prove the deduction theorem for the symmetric version of cirquent calculus, and show that the derivation in the deduction theorem will be at most polynomially longer than the proof of ...
متن کاملA finite model theorem for the propositional μ-calculus
We prove a finite model theorem and infinitary completeness result for the propositional μ-calculus. The construction establishes a link between finite model theorems for propositional program logics and the theory of wellquasi-orders.
متن کاملA semantical proof of the strong normalization theorem for full propositional classical natural deduction
We give in this paper a short semantical proof of the strong normalization for full propositional classical natural deduction. This proof is an adaptation of reducibility candidates introduced by J.-Y. Girard and simplified to the classical case by M. Parigot.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1979
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093882668